On the Number of Weakly Connected Subdigraphs in Random kNN Digraphs
نویسندگان
چکیده
منابع مشابه
Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
We consider the problem (MSSS) of nding a strongly connected spanning subgraph with the minimum number of arcs in a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the hamil-tonian cycle problem. We show that the problem is polynomially solvable for quasi-transitive digraphs. We describe the minimum number of arcs in such a spanning subgraph of a qu...
متن کاملThe asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges
Edward A. Benderl Depariment of Mathel1wtics, University of California, San Diego, La Jolla, CA 92093, USA E. Rodney Canfieldl Department of Computer Science, University of Georgia, Athens, GA 30602, USA Brendan D. McKay2 Computer Science Department, Australian National University, GPO Box 4, ACT 2601., Australia In a recent paper, we determined the asymptotic number of labelled connected graph...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملthe impact of e-readiness on ec success in public sector in iran the impact of e-readiness on ec success in public sector in iran
acknowledge the importance of e-commerce to their countries and to survival of their businesses and in creating and encouraging an atmosphere for the wide adoption and success of e-commerce in the long term. the investment for implementing e-commerce in the public sector is one of the areas which is focused in government‘s action plan for cross-disciplinary it development and e-readiness in go...
Generating connected acyclic digraphs uniformly at random
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non necessarily connected.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2020
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-020-00218-8